n,m=map(int,input().split())
ans=0
i=1
while ans<=m:
ans+=i
if i==n:
i=1
else:
i+=1
if i!=1:
print(m-(ans-i+1))
else:
print(m-(ans-n))
#include <bits/stdc++.h>
using namespace std;
int main()
{
int k, v;
cin >>k>>v;
v%= (k*(k+1)/ 2);
for (int i=1; i<= k;i++)
{
if (v< i)
{
break;
}
v-=i;
}
cout <<v<< endl;
return 0;
}1472B - Fair Division | 1281C - Cut and Paste |
141A - Amusing Joke | 112A - Petya and Strings |
677A - Vanya and Fence | 1621A - Stable Arrangement of Rooks |
472A - Design Tutorial Learn from Math | 1368A - C+= |
450A - Jzzhu and Children | 546A - Soldier and Bananas |
32B - Borze | 1651B - Prove Him Wrong |
381A - Sereja and Dima | 41A - Translation |
1559A - Mocha and Math | 832A - Sasha and Sticks |
292B - Network Topology | 1339A - Filling Diamonds |
910A - The Way to Home | 617A - Elephant |
48A - Rock-paper-scissors | 294A - Shaass and Oskols |
1213A - Chips Moving | 490A - Team Olympiad |
233A - Perfect Permutation | 1360A - Minimal Square |
467A - George and Accommodation | 893C - Rumor |
227B - Effective Approach | 1534B - Histogram Ugliness |